Asymptotic Cost of Cutting Down Random Free Trees
نویسنده
چکیده مقاله:
In this work, we calculate the limit distribution of the total cost incurred by splitting a tree selected at random from the set of all finite free trees. This total cost is considered to be an additive functional induced by a toll equal to the square of the size of tree. The main tools used are the recent results connecting the asymptotics of generating functions with the asymptotics of their Hadamard product, and the method of moments.
منابع مشابه
Cutting down $\mathbf p$-trees and inhomogeneous continuum random trees
We study a fragmentation of the p-trees of Camarri and Pitman [Elect. J. Probab., vol. 5, pp. 1–18, 2000]. We give exact correspondences between the p-trees and trees which encode the fragmentation. We then use these results to study the fragmentation of the ICRTs (scaling limits of p-trees) and give distributional correspondences between the ICRT and the tree encoding the fragmentation. The th...
متن کاملCutting down trees with a Markov chainsaw
We provide simplified proofs for the asymptotic distribution of the number of cuts required to cut down a Galton–Watson tree with critical, finite-variance offspring distribution, conditioned to have total progeny n. Our proof is based on a coupling which yields a precise, non-asymptotic distributional result for the case of uniformly random rooted labeled trees (or, equivalently, Poisson Galto...
متن کاملAsymptotic variance of random digital search trees
Asymptotics of the variances of many cost measures in random digital search trees are often notoriously messy and involved to obtain. A new approach is proposed to facilitate such an analysis for several shape parameters on random symmetric digital search trees. Our approach starts from a more careful normalization at the level of Poisson generating functions, which then provides an asymptotica...
متن کاملRandom cutting and records in deterministic and random trees
We study random cutting down of a rooted tree and show that the number of cuts is equal (in distribution) to the number of records in the tree when edges (or vertices) are assigned random labels. Limit theorems are given for this number, in particular when the tree is a random conditioned Galton–Watson tree. We consider both the distribution when both the tree and the cutting (or labels) are ra...
متن کاملAsymptotic degree distribution in random recursive trees
The distributions of vertex degrees in random recursive trees and random plane recursive trees are shown to be asymptotically normal. Formulas are given for the asymptotic variances and covariances of the number of vertices with given outdegrees. We also give functional limit theorems for the evolution as vertices are added. The proofs use some old and new results about generalized Pólya urn mo...
متن کاملNon-crossing trees revisited: cutting down and spanning subtrees
Here we consider two parameters for random non-crossing trees: i the number of random cuts to destroy a sizen non-crossing tree and ii the spanning subtree-size of p randomly chosen nodes in a size-n non-crossing tree. For both quantities, we are able to characterise for n ∞ the limiting distributions. Non-crossing trees are almost conditioned Galton-Watson trees, and it has been already shown,...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 11 شماره None
صفحات 57- 73
تاریخ انتشار 2012-03
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023